Multiple change-point detection via a screening and ranking algorithm
نویسندگان
چکیده
منابع مشابه
Multiple Change-Point Detection via a Screening and Ranking Algorithm.
Let Y1, …, Yn be a sequence whose underlying mean is a step function with an unknown number of the steps and unknown change points. The detection of the change points, namely the positions where the mean changes, is an important problem in such fields as engineering, economics, climatology and bioscience. This problem has attracted a lot of attention in statistics, and a variety of solutions ha...
متن کاملA sequential multiple change-point detection procedure via VIF regression
In this paper, we propose a procedure for detecting multiple change-points in a mean-shift model, where the number of change-points is allowed to increase with the sample size. A theoretic justification for our new method is also given. We first convert the change-point problem into a variable selection problem by partitioning the data sequence into several segments. Then, we apply a modified v...
متن کاملModified screening and ranking algorithm for copy number variation detection
MOTIVATION Copy number variation (CNV) is a type of structural variation, usually defined as genomic segments that are 1 kb or larger, which present variable copy numbers when compared with a reference genome. The screening and ranking algorithm (SaRa) was recently proposed as an efficient approach for multiple change-points detection, which can be applied to CNV detection. However, some practi...
متن کاملChange Point Detection Via Sub-Gaussian Fitting
This work presents a novel approach to detect a change in the state of a signal. We propose that in a given state, the values of a signal vary in a subrange of a Gaussian distribution. We describe methods to monitor a signal in real time for change points based upon sub-Gaussian fitting. The proposed algorithm was implemented and tested on heartrate variability data.
متن کاملAlgorithm Selection via Ranking
The abundance of algorithms developed to solve different problems has given rise to an important research question: How do we choose the best algorithm for a given problem? Known as algorithm selection, this issue has been prevailing in many domains, as no single algorithm can perform best on all problem instances. Traditional algorithm selection and portfolio construction methods typically tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistica Sinica
سال: 2013
ISSN: 1017-0405
DOI: 10.5705/ss.2012.018s